Parameterized Complexity of Independent Set in H-Free Graphs
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs
The Induced H-Matching problem asks to find k disjoint, induced subgraphs isomorphic to H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical Independent Set and Induced Matching problems, among several other problems. We show that Induced H-Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixe...
متن کاملParameterized Extension Complexity of Independent Set
Let G be a graph on n vertices and STABk(G) be the convex hull of characteristic vectors of its independent sets of size at most k. It is known that optimizing over STABk(G) is W [1]-hard and is FPT tractable for graphs of bounded expansion. We show analogous results for the extension complexity of STABk(G). In particular, we show that when G is a graph from a class of bounded expansion then xc...
متن کاملParameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
The maximum independent set problem is known to be NP-hard for graphs in general, but is solvable in polynomial time for graphs in many special classes. It is also known that the problem is generally intractable from a parameterized point of view. A simple Ramsey argument implies the fixed parameter tractability of the maximum independent set problem in classes of graphs of bounded clique numbe...
متن کاملParameterized algorithm for weighted independent set problem in bull-free graphs
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size k, when k is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size k. A polynomial kernel is un...
متن کاملThe complexity of independent set reconfiguration on bipartite graphs
We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model the problem is NP-complete. For the token sliding model, we show that the problem remains PSPACE-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2020
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00730-6